TSTP Solution File: SET607^5 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SET607^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 09:19:32 EDT 2024

% Result   : Theorem 0.21s 0.52s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : SET607^5 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n025.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 10:33:28 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.21/0.51  Running higher-order theorem proving
% 0.21/0.51  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.kxIISXldkU/E---3.1_2559.p
% 0.21/0.52  # Version: 3.1.0-ho
% 0.21/0.52  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.52  # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.52  # Starting new_bool_9 with 300s (1) cores
% 0.21/0.52  # Starting sh5l with 300s (1) cores
% 0.21/0.52  # sh5l with pid 2687 completed with status 0
% 0.21/0.52  # Result found by sh5l
% 0.21/0.52  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.52  # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.52  # Starting new_bool_9 with 300s (1) cores
% 0.21/0.52  # Starting sh5l with 300s (1) cores
% 0.21/0.52  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52  # Search class: HUUPF-FFSF00-MSSFFFNN
% 0.21/0.52  # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.21/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52  # Starting new_ho_10 with 181s (1) cores
% 0.21/0.52  # new_ho_10 with pid 2689 completed with status 0
% 0.21/0.52  # Result found by new_ho_10
% 0.21/0.52  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.21/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.21/0.52  # Starting post_as_ho10 with 300s (1) cores
% 0.21/0.52  # Starting new_bool_9 with 300s (1) cores
% 0.21/0.52  # Starting sh5l with 300s (1) cores
% 0.21/0.52  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52  # Search class: HUUPF-FFSF00-MSSFFFNN
% 0.21/0.52  # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.21/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52  # Starting new_ho_10 with 181s (1) cores
% 0.21/0.52  # Preprocessing time       : 0.001 s
% 0.21/0.52  # Presaturation interreduction done
% 0.21/0.52  
% 0.21/0.52  # Proof found!
% 0.21/0.52  # SZS status Theorem
% 0.21/0.52  # SZS output start CNFRefutation
% 0.21/0.52  thf(decl_sort1, type, a: $tType).
% 0.21/0.52  thf(decl_22, type, epred1_0: a > $o).
% 0.21/0.52  thf(decl_23, type, epred2_0: a > $o).
% 0.21/0.52  thf(decl_24, type, esk1_0: a).
% 0.21/0.52  thf(cBOOL_PROP_79_pme, conjecture, ![X1:a > $o, X2:a > $o]:(((^[X3:a]:(((X1 @ X3)|((X2 @ X3)&~((X1 @ X3))))))=(^[X3:a]:(((X1 @ X3)|(X2 @ X3)))))), file('/export/starexec/sandbox2/tmp/tmp.kxIISXldkU/E---3.1_2559.p', cBOOL_PROP_79_pme)).
% 0.21/0.52  thf(c_0_1, negated_conjecture, ~(![X1:a > $o, X2:a > $o]:(((^[Z0/* 9 */:a]:((X1 @ Z0|(X2 @ Z0&~(X1 @ Z0)))))=(^[Z0/* 9 */:a]:((X1 @ Z0|X2 @ Z0)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBOOL_PROP_79_pme])])).
% 0.21/0.52  thf(c_0_2, negated_conjecture, ((^[Z0/* 9 */:a]:((epred1_0 @ Z0|(epred2_0 @ Z0&~(epred1_0 @ Z0)))))!=(^[Z0/* 9 */:a]:((epred1_0 @ Z0|epred2_0 @ Z0)))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])).
% 0.21/0.52  thf(c_0_3, negated_conjecture, ((^[Z0/* 9 */:a]:(((epred1_0 @ Z0)|((epred2_0 @ Z0)&~((epred1_0 @ Z0))))))!=(^[Z0/* 9 */:a]:(((epred1_0 @ Z0)|(epred2_0 @ Z0))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.21/0.52  thf(c_0_4, negated_conjecture, (((epred1_0 @ esk1_0)|((epred2_0 @ esk1_0)&~((epred1_0 @ esk1_0))))<~>((epred1_0 @ esk1_0)|(epred2_0 @ esk1_0))), inference(neg_ext,[status(thm)],[c_0_3])).
% 0.21/0.52  thf(c_0_5, negated_conjecture, ~((epred1_0 @ esk1_0)), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])])).
% 0.21/0.52  thf(c_0_6, negated_conjecture, ~((epred2_0 @ esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]), c_0_5])).
% 0.21/0.52  thf(c_0_7, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]), c_0_6]), c_0_5]), ['proof']).
% 0.21/0.52  # SZS output end CNFRefutation
% 0.21/0.52  # Parsed axioms                        : 2
% 0.21/0.52  # Removed by relevancy pruning/SinE    : 1
% 0.21/0.52  # Initial clauses                      : 1
% 0.21/0.52  # Removed in clause preprocessing      : 0
% 0.21/0.52  # Initial clauses in saturation        : 1
% 0.21/0.52  # Processed clauses                    : 7
% 0.21/0.52  # ...of these trivial                  : 0
% 0.21/0.52  # ...subsumed                          : 1
% 0.21/0.52  # ...remaining for further processing  : 5
% 0.21/0.52  # Other redundant clauses eliminated   : 0
% 0.21/0.52  # Clauses deleted for lack of memory   : 0
% 0.21/0.52  # Backward-subsumed                    : 0
% 0.21/0.52  # Backward-rewritten                   : 0
% 0.21/0.52  # Generated clauses                    : 7
% 0.21/0.52  # ...of the previous two non-redundant : 5
% 0.21/0.52  # ...aggressively subsumed             : 0
% 0.21/0.52  # Contextual simplify-reflections      : 0
% 0.21/0.52  # Paramodulations                      : 0
% 0.21/0.52  # Factorizations                       : 0
% 0.21/0.52  # NegExts                              : 1
% 0.21/0.52  # Equation resolutions                 : 0
% 0.21/0.52  # Disequality decompositions           : 0
% 0.21/0.52  # Total rewrite steps                  : 0
% 0.21/0.52  # ...of those cached                   : 0
% 0.21/0.52  # Propositional unsat checks           : 0
% 0.21/0.52  #    Propositional check models        : 0
% 0.21/0.52  #    Propositional check unsatisfiable : 0
% 0.21/0.52  #    Propositional clauses             : 0
% 0.21/0.52  #    Propositional clauses after purity: 0
% 0.21/0.52  #    Propositional unsat core size     : 0
% 0.21/0.52  #    Propositional preprocessing time  : 0.000
% 0.21/0.52  #    Propositional encoding time       : 0.000
% 0.21/0.52  #    Propositional solver time         : 0.000
% 0.21/0.52  #    Success case prop preproc time    : 0.000
% 0.21/0.52  #    Success case prop encoding time   : 0.000
% 0.21/0.52  #    Success case prop solver time     : 0.000
% 0.21/0.52  # Current number of processed clauses  : 3
% 0.21/0.52  #    Positive orientable unit clauses  : 0
% 0.21/0.52  #    Positive unorientable unit clauses: 0
% 0.21/0.52  #    Negative unit clauses             : 3
% 0.21/0.52  #    Non-unit-clauses                  : 0
% 0.21/0.52  # Current number of unprocessed clauses: 0
% 0.21/0.52  # ...number of literals in the above   : 0
% 0.21/0.52  # Current number of archived formulas  : 0
% 0.21/0.52  # Current number of archived clauses   : 2
% 0.21/0.52  # Clause-clause subsumption calls (NU) : 0
% 0.21/0.52  # Rec. Clause-clause subsumption calls : 0
% 0.21/0.52  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.52  # Unit Clause-clause subsumption calls : 2
% 0.21/0.52  # Rewrite failures with RHS unbound    : 0
% 0.21/0.52  # BW rewrite match attempts            : 0
% 0.21/0.52  # BW rewrite match successes           : 0
% 0.21/0.52  # Condensation attempts                : 7
% 0.21/0.52  # Condensation successes               : 0
% 0.21/0.52  # Termbank termtop insertions          : 461
% 0.21/0.52  # Search garbage collected termcells   : 48
% 0.21/0.52  
% 0.21/0.52  # -------------------------------------------------
% 0.21/0.52  # User time                : 0.005 s
% 0.21/0.52  # System time              : 0.000 s
% 0.21/0.52  # Total time               : 0.005 s
% 0.21/0.52  # Maximum resident set size: 1636 pages
% 0.21/0.52  
% 0.21/0.52  # -------------------------------------------------
% 0.21/0.52  # User time                : 0.007 s
% 0.21/0.52  # System time              : 0.002 s
% 0.21/0.52  # Total time               : 0.010 s
% 0.21/0.52  # Maximum resident set size: 1720 pages
% 0.21/0.52  % E---3.1 exiting
% 0.21/0.52  % E exiting
%------------------------------------------------------------------------------